On h-Lexicalized Restarting Automata

On h-Lexicalized Restarting Automata

Following some previous studies on restarting automata, we introduce a refined model – the hlexicalized restarting automaton (h-RLWW). We argue that this model is useful for expressing lexicalized syntax in computational linguistics. We compare the input languages, which are the languages traditionally considered in automata theory, to the so-called basic and h-proper languages, which are (impl...

On h-Lexicalized Automata and h-Syntactic Analysis

Following some previous studies on list automata and restarting automata, we introduce a generalized and refined model – the h-lexicalized restarting list automaton (LxRLAW). We argue that this model is useful for expressing transparent variants of lexicalized syntactic analysis, and analysis by reduction in computational linguistics. We present several subclasses of LxRLAW and provide some var...

On Restarting Automata with Rewriting

Motivated by natural language analysis we introduce restarting automata with rewriting. They are acceptors on the one hand, and (special) regulated rewriting systems on the other hand. The computation of a restarting automaton proceeds in cycles: in each cycle, a bounded substring of the input word is rewritten by a shorter string, and the computation restarts on the arising shorter word. We sh...

Restarting Tree Automata

Restarting Automata: Motivations and Applications

Automata with restart operation (henceforth RA) constitute an interesting class of acceptors and reduction systems at the same time, and simultaneously display a remarkable ’explicative power’ wrt. the analysis of formal and natural languages. This paper focuses on RA as a formal-theoretical tool for modelling the analysis by reduction of natural languages and on the role of analysis by reducti...